MOX–Report No. 14/2010 A Mimetic Discretization of Elliptic Obstacle Problems
نویسندگان
چکیده
We develop a Finite Element method (FEM) which can adopt very general meshes with polygonal elements for the numerical approximation of elliptic obstacle problems. This kind of methods are also known as mimetic discretization schemes, which stem from the Mimetic Finite Di erence (MFD) method. The rst-order convergence estimate in a suitable (mesh-dependent) energy norm is established. Numerical experiments con rming the theoretical results are also presented.
منابع مشابه
Efficient and reliable hierarchical error estimates for the discretization error of elliptic obstacle problems
We present and analyze novel hierarchical a posteriori error estimates for self-adjoint elliptic obstacle problems. Our approach differs from straightforward, but nonreliable estimators by an additional extra term accounting for the deviation of the discrete free boundary in the localization step. We prove efficiency and reliability on a saturation assumption and a regularity condition on the u...
متن کاملConvergence Analysis of the mimetic Finite Difference Method for Elliptic Problems with Staggered Discretizations of Diffusion Coefficients
We propose a family of mimetic discretization schemes for elliptic problems including convection and reaction terms. Our approach is an extension of the mimetic methodology for purely diffusive problems on unstructured polygonal and polyhedral meshes. The a priori error analysis relies on the connection between the mimetic formulation and the lowest order Raviart–Thomas mixed finite element met...
متن کاملA Mimetic Discretization of Elliptic Control Problems
In this paper we investigate the Mimetic Finite Difference method for the approximation of a constraint optimal control problem governed by an elliptic operator. A priori error estimates of the first order are derived in suitable discrete norms for both the control and the state variables. The theoretical results are confirmed by numerical experiments performed on a set of test cases selected f...
متن کاملHierarchical A Posteriori Error Estimators for the Mimetic Discretization of Elliptic Problems
We present an a posteriori error estimate of hierarchical type for the mimetic discretization of elliptic problems. Under a saturation assumption, the global reliability and efficiency of the proposed a posteriori estimator are proved. Several numerical experiments assess the actual performance of the local error indicators in driving adaptive mesh refinement algorithms based on different marki...
متن کاملMultigrid Methods for Obstacle Problems
Obstacle problems can be posed as elliptic variational inequalities, complementarity inequalities and Hamilton-Jacobi-Bellman (HJB) partial differential equations (PDEs). In this paper, we propose a multigrid algorithm based on the full approximate scheme (FAS) for solving the membrane constrained obstacle problems and the minimal surface obstacle problems in the formulations of HJB equations. ...
متن کامل